Graph Representations and Traversal
نویسندگان
چکیده
A graph G = (V,E), where V is the set of vertices, and E is the set of edges. An edge e ∈ E is an unordered pair (u,v) in undirected graphs, where u,v∈V . In directed graphs, an edge e is an ordered pair. A path from a vertex u to a vertex v is a sequence of vertices (w0,w1, ...wk), where u = w0, v = wk and (wi−1,wi) ∈ E for all 1 ≤ i ≤ k. The path is a cycle if u = v. The length of a path in an unweighted graph is the number of edges on the path. The length of a path in a weighted graph is the sum of the weights of all edges on the path. The distance between two vertices u and v is defined as the length of the shortest path connecting them.
منابع مشابه
An Experimental Study on Transitive Closure Representations
We present two new compact transitive closure representations. The rst uses intervals and the second chains to store the closure. Both representations are based on previous methods designed for acyclic graphs. The new representations are applicable to all kinds of graphs, and can be eeciently constructed during a single traversal of the input graph. We compared experimentally the average size o...
متن کاملGeneralising tree traversals and tree transformations to DAGs: Exploiting sharing without the pain
We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs. Our recursion scheme allows the programmer to implement a tree traversal or a tree transformation and then apply it to compact graph representations of trees instead. The resulting graph traversal or graph transformation avoids recomputation of intermediate results for shared...
متن کاملdominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملText Mining with Graph Databases: Traversal of Persisted Token-Level Representations for Flexible On-Demand Processing
This contribution introduces a new text modelling paradigm that allows for on-demand Text Mining approaches without the need for pre-calculated statistics or data structures other than generic edgetyped adjacency information in a graph database. A simple use cases is presented, for which these new text storing and querying methods can prove beneficial. Furthermore a prototypical implementation ...
متن کاملRepresenting Web Graphs
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navigation of the Web graph. However, efficient traversal of huge Web graphs containing several hundred million vertices and a few billion edges is a challenging problem. An additional complication is the lack of a schema t...
متن کاملEstimations of Power Consumption in Asynchronous Logic as Derived from Graph Based Circuit Representations
We present a technique for the estimation of power consumption in asynchronous circuits through the modelling of transition switching activity. Unlike most existing techniques for analytic (non-simulation) power estimation that use reachability state traversal and Markov chain analysis, our method is based on an invariant analysis of Petri Net models using matrix representations. This approach ...
متن کامل